An Overview of Rough Set Theory from the Point of View of Relational Databases

نویسنده

  • T. Y. Lin
چکیده

Both relational database theory (RDB) and rough set theory (RS) are formal theories derived from the study of tables. However, they were based on different philosophies and went on to different directions. RDB assumes semantics of data is known and focuses on organizing data through its semantics. RS, in this table format, assumes data semantics is defined by the given data and focuses on discovering patterns, rules and data semantics through those available data a data mining theory. In this paper, fundamental notions of two theories are compared and summarized. Further, RS can also take abstract format. In this format it can be used to analyze imprecise, uncertain or incomplete information in data. It is a new set theory complimentary to fuzzy set theory. In this paper, this aspect is only lightly touched.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Application of Rough Set Theory in Data Mining for Decision Support Systems (DSSs)

Decision support systems (DSSs) are prevalent information systems for decision making in many competitive business environments. In a DSS, decision making process is intimately related to some factors which determine the quality of information systems and their related products. Traditional approaches to data analysis usually cannot be implemented in sophisticated Companies, where managers ne...

متن کامل

Topological structure on generalized approximation space related to n-arry relation

Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...

متن کامل

A Logic of Type Relations and its Applications to Relational Databases

A calculus of typed relations subsuming the classical relational database theory is presented. An associated sound and complete deduction mechanism is developed. The formulation is generalized to deal with nondeterministic databases and information relations in the rough set-style. keywords: relational logic, typed relations, relational database, nondeterministic databases, information relation...

متن کامل

Evaluation of Rough Set Theory for Decision Making of rehabilitation Method for Concrete Pavement

In recent years a great number of advanced theoretical - empirical methods has been developed for design & modeling concrete pavements distress. But there is no reliable theoretical method to be use in evaluation of conerete pavements distresses and making a decision about repairing them. Only empirical methods is used for this reason. One of the most usual methods in evaluating concrete paveme...

متن کامل

Reduction of DEA-Performance Factors Using Rough Set Theory: An Application of Companies in the Iranian Stock Exchange

he financial management field has witnessed significant developments in recent years to help decision makers, managers and investors, to made optimal decisions. In this regard, the institutions investment strategies and their evaluation methods continuously change with the rapid transfer of information and access to the fi- nancial data. When information is available ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005